Properties of Random Triangulations and Trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of Random Triangulations and Trees

Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural “geometric” features of a triangulation τ ∈ Tn, for example ∆n(τ) which counts the maximal number of diagonals in τ incident to a single vertex of K. It is familiar that Tn is bijectively equivalent to Bn, the set of rooted binary trees with n− 2 internal nodes, and also to P...

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Extremal properties of random trees.

We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights approaches a traveling wave form. The wave front in the minimal case is governed by the small-extremal-height tail of the distribution, and conversely, the front in ...

متن کامل

The properties of random trees

Consider an s-ary tree (in which every node has no more than s children). Each node holds a single datum, including a key. These are the oaaupied, internal, or aZosed nodes of the data-structure. Augment the tree, following D. E. Knuth, by adding a set of unoaaupied, ezternaZ, open, or free nodes, so that every internal node now has just s children and every external node has no children. We as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 1999

ISSN: 0179-5376

DOI: 10.1007/pl00009444